Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f3(x, y, f3(z, u, v)) -> f3(f3(x, y, z), u, f3(x, y, v))

Q is empty.


QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f3(x, y, f3(z, u, v)) -> f3(f3(x, y, z), u, f3(x, y, v))

Q is empty.

Q DP problem:
The TRS P consists of the following rules:

F3(x, y, f3(z, u, v)) -> F3(x, y, v)
F3(x, y, f3(z, u, v)) -> F3(x, y, z)
F3(x, y, f3(z, u, v)) -> F3(f3(x, y, z), u, f3(x, y, v))

The TRS R consists of the following rules:

f3(x, y, f3(z, u, v)) -> f3(f3(x, y, z), u, f3(x, y, v))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP

Q DP problem:
The TRS P consists of the following rules:

F3(x, y, f3(z, u, v)) -> F3(x, y, v)
F3(x, y, f3(z, u, v)) -> F3(x, y, z)
F3(x, y, f3(z, u, v)) -> F3(f3(x, y, z), u, f3(x, y, v))

The TRS R consists of the following rules:

f3(x, y, f3(z, u, v)) -> f3(f3(x, y, z), u, f3(x, y, v))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.